An exact method for the double TSP with multiple stacks
نویسندگان
چکیده
منابع مشابه
An exact method for the double TSP with multiple stacks
The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...
متن کاملDTU Management Engineering An Exact Method for the Double TSP with Multiple Stacks
The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...
متن کاملThe Double TSP with Multiple Stacks - Formulation and Heuristic Solution Approaches
This paper introduces the Double Travelling Salesman Problem with Multiple Stacks and presents three different metaheuristic approaches to its solution. The Double TSP with Multiple Stacks is concerned with determining the shortest route performing pickups and deliveries in two separated networks (one for pickups and one for deliveries) using only one container. Repacking is not allowed, instea...
متن کاملA Branch-and-Bound Algorithm for the Double TSP with Two Stacks
This paper studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs...
متن کاملAn Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251), improving the previous bound O(1.260) by Eppstein.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2010
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2009.00748.x